package com.wc.AlgoOJ_homework.aloj模拟赛.斐波那契与7;

/**
 * @Author congge
 * @Date 2024/5/30 21:53
 * @description http://43.138.190.70:8888/p/LQL?tid=6655c0f9c056ef947a21997d
 */
public class Main {
    static int N = 1000010;
    static int[] f = new int[N];

    public static void main(String[] args) {
        f[1] = f[2] = 1;
        int res = 0;
        for (int i = 3; i < N; i++) {
            f[i] = (f[i - 1] + f[i - 2]) % 10;
            if (f[i] == 7) res++;
            if (f[i] == 0 && f[i - 1] == 1) {
                System.out.println(i);
                break;
            }
        }
        long n = 202202011200L;
        long cycle = n / 60;
        long re = 0;
        System.out.println(cycle * 8);
        System.out.println(re);
    }
}

